Load rebalancing games in dynamic systems with migration costs
نویسندگان
چکیده
منابع مشابه
Load Rebalancing Games in Dynamic Systems with Migration Costs
We consider the following dynamic load balancing game: Given an initial assignment of jobs to identical parallel machines, the system is modified; specifically, some machines are added or removed. Each job’s cost is the load on the machine it is assigned to; thus, when machines are added, jobs have an incentive to migrate to the new unloaded machines. When machines are removed, the jobs assigne...
متن کاملRebalancing the Load in Distributed File Systems
Distributed file systems are key building blocks for cloud computing applications supported the Map Reduce programming paradigm. In such file systems, nodes at the same time serve computing and storage functions; a file is partitioned off into variety of chunks allotted in distinct nodes so Map Reduce tasks are often performed in parallel over the nodes. However, in a cloud computing setting, f...
متن کاملSurvey on Load Rebalancing For Distributed File Systems in Clouds
Cloud Computing is an emerging technology, it is based on demand service in which shared resources, information, software and other devices are provided according to the clients to the requirements at specific time with the availability of internet. Load balancing is one of the challenging issue in cloud computing. An efficient load balancing makes cloud computing more efficient and improves us...
متن کاملSecure Load Rebalancing Algorithm for Distributed File Systems in Cloud
Distributed file systems are key technology for cloud computing applications. In such file system, each node having storage as well as computing functionalities. A file is partitioned into a number of chunks allocated in distinct nodes so that data processing can be performed in parallel. Specifically, in this study, we suggest offloading the load rebalancing task to storage nodes by having the...
متن کاملOptimal Rebalancing of Portfolios with Transaction Costs
Rebalancing of portfolios with a concave utility function is considered. It is proved that transaction costs imply that there is a no-trade region where it is optimal not to trade. For proportional transaction costs it is optimal to rebalance to the boundary when outside the no-trade region. With flat transaction costs, the rebalance from outside the no-trade region should be to an internal sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.01.030